Multicommodity flows over time: Efficient algorithms and complexity
نویسندگان
چکیده
منابع مشابه
Multicommodity Flows over Time: Efficient Algorithms and Complexity
Flow variation over time is an important feature in network flow problems arising in various applications such as road or air traffic control, production systems, communication networks (e.g., the Internet), and financial flows. The common characteristic are networks with capacities and transit times on the arcs which specify the amount of time it takes for flow to travel through a particular a...
متن کاملThe cut cone, L1 embeddability, complexity, and multicommodity flows
A finite metric (or more properly semimetric) on n points is a non-negative vector d = (dij) 1 ≤ i < j ≤ n that satisfies the triangle inequality: dij ≤ dik + d jk . The L (or Manhattan )distance | |x − y| |1 between two vectors x = (xi) and y = (yi) in R is given by | |x − y| |1 = 1≤i≤m Σ |xi − yi |. A metric d is L − embeddable if there exist vectors z1, z2, . . . , zn in R for some m, such t...
متن کاملOn Complexity, Representation and Approximation of Integral Multicommodity Flows
The paper has two parts. In the algorithmic part integer inequality systems of packing types and their application to integral multicommodity ow problems are considered. We give 1 ? approximation algorithms using the randomized rounding/de-randomiztion scheme provided that the components of the right hand side vector resp. the capacities are in (?2 log m) where m is the number of constraints re...
متن کاملMulticommodity Flows and Polyhedra
Seymour s conjecture on binary clutters with the so called weak or Q max ow min cut property implies if true a wide variety of results in combinatorial optimization about objects ranging from matchings to mul ticommodity ows and disjoint paths In this paper we review in particular the relation between classes of multicommodity ow problems for which the so called cut condition is su cient and cl...
متن کاملRobust Flows over Time: Models and Complexity Results
We study dynamic network flows with uncertain input data under a robust optimization perspective. In the dynamic maximum flow problem, the goal is to maximize the flow reaching the sink within a given time horizon T , while flow requires a certain travel time to traverse an edge. In our setting, we account for uncertain travel times of flow. We investigate maximum flows over time under the assu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.02.046